Modeling Nonconvex Constraints Using Linear Complementarity
نویسندگان
چکیده
Many physical simulators linearize contact constraints such that each contact constraint defines a half-space in the configuration space of the effected objects. By modeling contact constraints as infinitely extending half spaces it is only possible to approximate regions in configuration space that are locally convex. This implicit assumption of local convexity introduces artifacts in the results of the simulation. We present a new method for modeling regions of configuration space that are locally nonconvex using a linear complementarity formulation. From this we show that we can now accurately represent any general polytope using linear complementarity.
منابع مشابه
Solving Linear Programs with Complementarity Constraints using Branch-and-Cut
A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with additional linear complementarity constraints. This class has emerged as a modeling paradigm for a broad collection of problems, including bilevel programs, Stackelberg games, inverse quadratic programs, and problems involving equilibrium...
متن کاملInterior-point Methods for Nonconvex Nonlinear Programming: Complementarity Constraints
In this paper, we present the formulation and solution of optimization problems with complementarity constraints using an interior-point method for nonconvex nonlinear programming. We identify possible difficulties that could arise, such as unbounded faces of dual variables, linear dependence of constraint gradients and initialization issues. We suggest remedies. We include encouraging numerica...
متن کاملOptimization with Linear Complementarity Constraints
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem where a continuously differentiable function is minimized on a set defined by linear constraints and complementarity conditions on pairs of complementary variables. This problem finds many applications in several areas of science, engineering and economics and is also an important tool for the solu...
متن کاملAlgorithms for Linear Programming with Linear Complementarity Constraints
Linear programming with linear complementarity constraints (LPLCC) is an area of active research in Optimization, due to its many applications, algorithms, and theoretical existence results. In this paper, a number of formulations for important nonconvex optimization problems are first reviewed. The most relevant algorithms for computing a complementary feasible solution, a stationary point, an...
متن کاملGlobal Convergence of ADMM in Nonconvex Nonsmooth Optimization
In this paper, we analyze the convergence of the alternating direction method of multipliers (ADMM) for minimizing a nonconvex and possibly nonsmooth objective function, φ(x0, . . . , xp, y), subject to coupled linear equality constraints. Our ADMM updates each of the primal variables x0, . . . , xp, y, followed by updating the dual variable. We separate the variable y from xi’s as it has a spe...
متن کامل